Watertight ray traversal with reduced precision
نویسندگان
چکیده
Reduced precision bounding volume hierarchies and ray traversal can significantly improve the efficiency of ray tracing through low-cost dedicated hardware. A key approach to enabling reduced precision computations during traversal is to translate the ray origin closer to the bounding volume hierarchy node after each traversal step. However, this approach precludes sharing of intersection computations between a parent node and its two children, which is an important optimization. In this paper, we introduce a novel traversal algorithm that addresses this limitation and achieves a significant reduction in the computational complexity of traversal compared to previous approaches. We also include an analysis that shows how our algorithm guarantees watertight intersections which is a key requirement for robust image quality, especially with reduced precision traversal where numerical errors can be large.
منابع مشابه
Watertight Ray/Triangle Intersection
We propose a novel algorithm for ray/triangle intersection tests that, unlike most other such algorithms, is watertight at both edges and vertices for adjoining triangles, while also maintaining the same performance as simpler algorithms that are not watertight. Our algorithm is straightforward to implement, and is, in particular, robust for all triangle configurations including extreme cases, ...
متن کاملReduced Precision for Hardware Ray Tracing in GPUs
We propose a high performance, GPU integrated, hardware ray tracing system. We present and make use of a new analysis of ray traversal in axis aligned bounding volume hierarchies. This analysis enables compact traversal hardware through the use of reduced precision arithmetic. We also propose a new cache based technique for scheduling ray traversal. With the addition of our compact fixed functi...
متن کاملRobust BVH Ray Traversal
Most axis-aligned bounding-box (AABB) based BVH-construction algorithms are numerically robust; however, BVH ray traversal algorithms for ray tracing are still susceptible to numerical precision errors. We show where these errors come from and how they can be efficiently avoided during traversal of BVHs that use AABBs.
متن کاملRobust BVH Ray Traversal - revised
Most axis-aligned bounding-box (AABB) based BVH-construction algorithms are numerically robust; however, BVH ray traversal algorithms for ray tracing are still susceptible to numerical precision errors. We show where these errors come from and how they can be efficiently avoided during traversal of BVHs that use AABBs.
متن کاملUsing Half-Precision Floating-Point Numbers for Storing Bounding Volume Hierarchies
Bounding volume hierarchies, which are commonly used to speed up ray tracing, are heavily accessed during ray traversal. Reducing the memory footprint for the bounding volume hierarchies leads to a better cache hit ratio and, therefore, faster ray tracing. This paper examines an approach of using 16-bit halfprecision floating-point numbers to store bounding volume hierarchy inner nodes. Compare...
متن کامل